Graph homomorphisms on rectangular matrices over divisionrings I
نویسندگان
چکیده
منابع مشابه
Path homomorphisms, graph colorings, and boolean matrices
We investigate bounds on the chromatic number of a graph G derived from the nonexistence of homomorphisms from some path ~ P into some orientation ~ G of G. The condition is often efficiently verifiable using boolean matrix multiplications. However, the bound associated to a path ~ P depends on the relation between the “algebraic length” and “derived algebraic length” of ~ P . This suggests tha...
متن کاملOn Weighted Graph Homomorphisms
For given graphs G and H , let |Hom(G,H)| denote the set of graph homomorphisms from G to H . We show that for any finite, n-regular, bipartite graph G and any finite graph H (perhaps with loops), |Hom(G,H)| is maximum when G is a disjoint union of Kn,n’s. This generalizes a result of J. Kahn on the number of independent sets in a regular bipartite graph. We also give the asymptotics of the log...
متن کاملOn Eigenvalues of Rectangular Matrices
Given a (k+1)-tuple A,B1, . . . , Bk of (m×n)-matrices withm ≤ n we call the set of all k-tuples of complex numbers {λ1, . . . , λk} such that the linear combination A + λ1B1 + λ2B2 + . . . + λkBk has rank smaller than m the eigenvalue locus of the latter pencil. Motivated primarily by applications to multi-parameter generalizations of the Heine-Stieltjes spectral problem, see [He] and [Vol], w...
متن کاملOn Eigenvalues of Rectangular Matrices
Given a (k+1)-tuple A,B1, . . . , Bk of (m×n)-matrices withm ≤ n we call the set of all k-tuples of complex numbers {λ1, . . . , λk} such that the linear combination A + λ1B1 + λ2B2 + . . . + λkBk has rank smaller than m the eigenvalue locus of the latter pencil. Motivated primarily by applications to multi-parameter generalizations of the Heine-Stieltjes spectral problem, see [He] and [Vol], w...
متن کاملGraph Powers and Graph Homomorphisms
In this paper we investigate some basic properties of fractional powers. In this regard, we show that for any rational number 1 ≤ 2r+1 2s+1 < og(G), G 2r+1 2s+1 −→ H if and only if G −→ H− 2s+1 2r+1 . Also, for two rational numbers 2r+1 2s+1 < 2p+1 2q+1 and a non-bipartite graph G, we show that G 2r+1 2s+1 < G 2p+1 2q+1 . In the sequel, we introduce an equivalent definition for circular chromat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SCIENTIA SINICA Mathematica
سال: 2018
ISSN: 1674-7216
DOI: 10.1360/n012017-00179